Solving Flexible Flow-shop Problems by Lpt and Ln Scheduling Algorithms

Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling not only reduces manufacturing costs but also reduces possibilities for violating due dates. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow-shop problem. Flexible flow shops can thus be thought of as generalizations of simple flow shops. In the past, Sriskandarajah and Sethi proposed a heuristic algorithm for solving flexible flow-shop problems of two machine centers. In this paper, we extend their algorithm to solve flexible flow-shop problems of more than two machine centers. The heuristic LN algorithm is adopted as the kernel for achieving this purpose. Since this problem is NP-complete, optimal solutions seem unnecessary especially when the number of jobs is large. AMS Subject Classification Code: 90B35